منابع مشابه
Generalized fuzzy rough sets
This paper presents a general framework for the study of fuzzy rough sets in which both constructive and axiomatic approaches are used. In constructive approach, a pair of lower and upper generalized approximation operators is defined. The connections between fuzzy relations and fuzzy rough approximation operators are examined. In axiomatic approach, various classes of fuzzy rough approximation...
متن کامل$r$-fuzzy regular semi open sets in smooth topological spaces
In this paper, we introduce and study the concept of $r$-fuzzy regular semi open (closed) sets in smooth topological spaces. By using $r$-fuzzy regular semi open (closed) sets, we define a new fuzzy closure operator namely $r$-fuzzy regular semi interior (closure) operator. Also, we introduce fuzzy regular semi continuous and fuzzy regular semi irresolute mappings. Moreover, we investigate the ...
متن کاملQuantification of R-fuzzy sets
The main aim of this paper is to connect R-Fuzzy sets and type-2 fuzzy sets, so as to provide a practical means to express complex uncertainty without the associated difficulty of a type-2 fuzzy set. The paper puts forward a significance measure, to provide a means for understanding the importance of the membership values contained within an R-fuzzy set. The pairing of an R-fuzzy set and the si...
متن کاملOn lattices of convex sets in R
Properties of several sorts of lattices of convex subsets of Rn are examined. The lattice of convex sets containing the origin turns out, for n > 1, to satisfy a set of identities strictly between those of the lattice of all convex subsets of Rn and the lattice of all convex subsets of R. The lattices of arbitrary, of open bounded, and of compact convex sets in Rn all satisfy the same identitie...
متن کاملCharacterizing Certain Staircase Convex Sets in R
Let C = {C1, . . . , Cn} be a family of distinct boxes in R whose intersection graph is a tree, and let S = C1∪· · ·∪Cn. Let T ⊆ S. The set T lies in a staircase convex subset of S if and only if for every a, b in T there is an a−b staircase path in S. This result, in turn, yields necessary and sufficient conditions for S to be a union of k staircase convex sets, k ≥ 1. Analogous results charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2012.01.293